-
1 Embedded Block Coding with Optimal Truncation
Универсальный русско-английский словарь > Embedded Block Coding with Optimal Truncation
-
2 оптимальное кодирование
Русско-английский политехнический словарь > оптимальное кодирование
-
3 оптимальное программирование
Русско-английский политехнический словарь > оптимальное программирование
-
4 оптимальное кодирование
оптимальное кодирование
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
EN
Русско-английский словарь нормативно-технической терминологии > оптимальное кодирование
-
5 оптимальное программирование
1) Engineering: optimal coding2) Mathematics: optimal programming3) Economy: optimum programming4) Information technology: least wait programming, minimal-access programming, minimum access programming, minimum delay programming, minimum latency programming, optimum codingУниверсальный русско-английский словарь > оптимальное программирование
-
6 оптимальное кодирование
1) Engineering: optimal coding2) Information technology: optimum codingУниверсальный русско-английский словарь > оптимальное кодирование
-
7 оптимальное кодирование
optimum coding, optimal codingРусско-английский научно-технический словарь Масловского > оптимальное кодирование
-
8 оптимальный
1. optimal2. optimally3. optimumРусско-английский словарь по информационным технологиям > оптимальный
См. также в других словарях:
Coding theory — is the study of the properties of codes and their fitness for a specific application. Codes are used for data compression, cryptography, error correction and more recently also for network coding. Codes are studied by various scientific… … Wikipedia
Optimal control — theory, an extension of the calculus of variations, is a mathematical optimization method for deriving control policies. The method is largely due to the work of Lev Pontryagin and his collaborators in the Soviet Union[1] and Richard Bellman in… … Wikipedia
Huffman coding — Huffman tree generated from the exact frequencies of the text this is an example of a huffman tree . The frequencies and codes of each character are below. Encoding the sentence with this code requires 135 bits, as opposed of 288 bits if 36… … Wikipedia
Shannon–Fano coding — In the field of data compression, Shannon Fano coding is a suboptimal technique for constructing a prefix code based on a set of symbols and their probabilities (estimated or measured). The technique was proposed prior to the optimal technique of … Wikipedia
Arithmetic coding — is a method for lossless data compression. Normally, a string of characters such as the words hello there is represented using a fixed number of bits per character, as in the ASCII code. Like Huffman coding, arithmetic coding is a form of… … Wikipedia
Distributed source coding — (DSC) is an important problem in information theory and communication. DSC problems regard the compression of multiple correlated information sources that do not communicate with each other.[1] By modeling the correlation between multiple sources … Wikipedia
Unary coding — is an entropy encoding that represents a natural number, n , with n − 1 ones followed by a zero. For example 5 is represented as 11110. Some representations use n − 1 zeros followed by a one. The ones and zeros are interchangeable without loss of … Wikipedia
Network coding — is a technique where, instead of simply relaying the packets of information they receive, the nodes of a network will take several packets and combine them together for transmission. This can be used to attain the maximum possible information… … Wikipedia
Golomb coding — is a data compression scheme invented by Solomon W. Golomb in the 1960s. The scheme is based on entropy encoding and is optimal (in the sense of Shannon s source coding theorem) for alphabets following a geometric distribution, making it highly… … Wikipedia
Shannon's source coding theorem — In information theory, Shannon s source coding theorem (or noiseless coding theorem) establishes the limits to possible data compression, and the operational meaning of the Shannon entropy.The source coding theorem shows that (in the limit, as… … Wikipedia
Color-coding — For other uses, see Color code. In computer science and graph theory, the method of color coding[1][2] efficiently finds k vertex simple paths, k vertex cycles, and other small subgraphs within a given graph using probabilistic algorithms, which… … Wikipedia